Neighbour Selection Protocol for Information Dissemination through P2P Interactions in Opportunistic Network

نویسندگان

  • Halikul Bin Lenando
  • Abdalla Hassan Gharib
  • Mohamad Nazim Jambli
چکیده

In Opportunistic Networks, information forwarding is involved when nodes are in range. Absence of network topology knowledge of Opportunistic Network makes information forwarding the most compelling challenge. Endto-end communication in Opportunistic Networks is supported naturally through nodes’ mobility. Disconnected peers are opportunistically connected to each other dynamically as information is disseminated to the intended destination. Flooding is data dissemination-based technique which diffuses the information to all nodes in range in the network which eventually reach the destination. This form of dissemination congests the network and create considerable amount of network overheads. In this paper, a social-based neighbor selection protocol is proposed to enhance the homogeneous information dissemination through peer-to-peer interaction in Opportunistic Networks. Selection mechanism is introduced, which enables peers to select its neighbour based on Frequency in Range and Frequency of Interaction metrics. Connected pair of nodes exchange homogeneous information during opportunistic encounters with the aim of disseminating information across the network. A potential neighbour with larger metrics values is selected among all neighboring nodes in communication range to disseminate information. The impact of our protocol to information dissemination was studied and has been analyzed in simulation tool developed in Java. Experimental results obtained showed that the proposed neighbor selection protocol is efficient and useful for homogeneous information dissemination through peer-to-peer interaction in Opportunistic networks. Keywords— context information, frequency in range, frequency of interaction, homogeneous information, information dissemination, neighbor selection, opportunistic network, peer-to-peer interaction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Leach Routing Algorithm Optimization through Imperialist Approach

Routing is an important challenge in WSN due to the presence of hundreds or thousands of sensor nodes. Low Energy Adaptive Clustering Hierarchy (LEACH) is a hierarchical routing and data dissemination protocol. LEACH divides a network domain into several sub-domains that are called clusters. Non-uniformity of cluster distribution and CHs selection without considering the positions of other sens...

متن کامل

P2P Network Trust Management Survey

Peer-to-peer applications (P2P) are no longer limited to home users, and start being accepted in academic and corporate environments. While file sharing and instant messaging applications are the most traditional examples, they are no longer the only ones benefiting from the potential advantages of P2P networks. For example, network file storage, data transmission, distributed computing, and co...

متن کامل

ISP-aided neighbour selection in peer-to-peer systems

Peer-to-peer (P2P) systems account for more than half of Internet traffic today, and an increasing number of user applications, e.g., Bittorrent, eDonkey, Joost, Skype, GoogleTalk, and P2P-TV, rely on P2P methodology. P2P systems build overlays at the application layer, independently of Internet routing and ISP topologies. This leads to measurement traffic overhead and routing inefficiencies fo...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

Enabling Information Centric Networks through Opportunistic Search, Routing and Caching

Content dissemination networks are pervasive in todays’ Internet. Examples of content dissemination networks include peer-to-peer networks (P2P), content distribution networks (CDN) and information centric networks (ICN). In this paper, we propose a new system design for information centric networks which leverages opportunistic searching, routing and caching. Our system design is based on an h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013